Isomorphic subgraphs having minimal intersections
نویسندگان
چکیده
منابع مشابه
Minimal decompositions of graphs into mutually isomorphic subgraphs
Suppose 9.= !{pGl , . . ., Gk} is a collection of graphs, all having n vertices and e edges. By a U-decomposition of T„ we mean a set of partitions of the edge sets E(G,) of the G,, say E(G,)= = E E,f , such that for each j, all the E,j , 15 is k, are isomorphic as graphs . Define the function U(T„) to be the least possible value of r a U-decomposition of W„ can have . Finally, let Uk (n) denot...
متن کاملOn isomorphic subgraphs
Gould, R.J. and V. RodI, On isomorphic subgraphs, Discrete Mathematics 118 (1993) 2599262. We prove that every 3-uniform hypergraph with 4 edges contain two edge disjoint isomorphic subgraphs with at least L&A J edges, This answers a question of Erdiis, Path and Pyber. Recently, the following question was independently raised by MS. Jacobson (personal communication) and J. Schonheim (see Cl]). ...
متن کاملComputing and Drawing Isomorphic Subgraphs
The isomorphic subgraph problem is finding two disjoint subgraphs of a graph which coincide on at least k edges. The graph is partitioned into a subgraph, its copy, and a remainder. The problem resembles the NP-hard largest common subgraph problem, which searches copies of a graph in a pair of graphs. In this paper we show that the isomorphic subgraph problem is NP-hard, even for restricted ins...
متن کاملHaving Isomorphic Symmetry Algebras
In this article, results from the previous paper (I) are applied to calculations of squeezed states for such well-known systems as the harmonic oscillator, free particle, linear potential, oscillator with a uniform driving force, and repulsive oscillator. For each example, expressions for the expectation values of position and momentum are derived in terms of the initial position and momentum, ...
متن کاملIsomorphic Subgraphs in a Graph
At the combinatorics meeting of this Proceedings J . Schönheim posed the following problem : Is it true, that every graph of n edges has two (not necessarily induced isomorphic edge disjoint subgraphs with say f edges? In the present note we answer this question in the affirmative . In fact we prove that every graph of n edges contains two isomorphic edge disjoint subgraphs with cn 2/3 edges an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics
سال: 1983
ISSN: 0263-6115
DOI: 10.1017/s1446788700026987